package Tools;

public abstract class MathFP {

  public static int sin(int value,int r){//参数1 角度 2 半径 得到圆上任意一点的y、
	  
	  	if(value < 0){
	  		value = 360 + value;
	  	}
	  	
       return (sin_Angle(value)*r)/1000;  
  }
  public static int cos(int value,int r){// 得到圆上任意一点的x、
	  if(value < 0){
	  		value = 360 + value;
	  	}
	  
      return (cos_Angle(value)*r)/1000;
 }
  /**
   * 得到圆上任意一点坐标，
   * @param angle 与X轴顺时针方向的角度
   * @param r  圆半径
   * @return Y坐标 需要加上圆心坐标
   */
 public static float sin(float angle,float r)
 {
	 return (float)Math.sin(Math.PI*angle/180)*r;
 }
 public static float cos(float angle,float r)
 {
	 return (float)Math.cos(Math.PI*angle/180)*r;
 }
  public static final int sin_Angle(int angle) {
        angle %= 360; // 360 degrees
        if (angle < 0) {
            angle = 360 + angle;
        }
        if (angle <= 90) { // 0..90 degrees
            return SIN[angle];
        }
        else if (angle <= 180) { // 90..180 degrees
            return SIN[180 - angle];
        }
        else if (angle <= 270) { // 180..270 degrees
            return -SIN[angle - 180];
        }
        else { // 270..360 degrees
            return -SIN[360 - angle];
        }
    }

    public static final int cos_Angle(int angle) {
        return sin_Angle(angle + 90); // i.e. add 90 degrees
    }


    public static final int SIN[] = {
        //  0      1      2      3      4      5      6      7      8      9
        0,     18,    36,    54,    71,    89,    107,   125,   143,   160,
        178,   193,   213,   230,   248,   265,   282,   299,   316,   333,
        350,   367,   384,   400,   417,   433,   449,   465,   481,   496,
        512,   527,   543,   558,   573,   587,   602,   616,   630,   644,
        658,   672,   685,   698,   711,   724,   737,   749,   761,   773,
        784,   796,   807,   818,   828,   839,   849,   859,   868,   878,
        887,   896,   904,   912,   920,   928,   936,   943,   949,   956,
        962,   968,   974,   979,   984,   989,   994,   998,   1002,  1005,
        1008,  1011,  1014,  1016,  1018,  1020,  1022,  1023,  1023,  1024,
        1024,
    };

    
    private static final short[] TAN={
        17,  35,  53,  71,  89,  107, 125, 143, 162, 180,
        199, 217, 236, 255, 274, 293, 313, 332, 352, 372,
        393, 413, 434, 455, 477, 499, 521, 544, 567, 591,
        615, 639, 664, 690, 717, 743, 771, 800, 829, 859,
        890, 922, 954, 988, 1024 
        };

    public static final int angle(int originX,int originY,int targetX,int targetY){//任意2点之间与x轴行程的角度。得出的角度是顺时针方向
        int angleX = targetX - originX;
        int angleY = targetY - originY;
        if(angleX >= 0 && angleY > 0){
          if(angleX < angleY){
            return 90-baseAngle(angleX,angleY);
          }else if(angleX > angleY){
            return baseAngle(angleY,angleX);
          }else if(angleX == angleY){
            return 45;
          }else return 90;
        }else if(angleX < 0 && angleY >= 0){
          if(Math.abs(angleX) < angleY){
            return 90+baseAngle(angleX,angleY);
          }else if(Math.abs(angleX) > angleY){
            return 180-baseAngle(angleY,angleX);
          }else if(Math.abs(angleX) == angleY){
            return 135;
          }else return 180;
        }else if(angleX <= 0 && angleY < 0){
          if(Math.abs(angleX) < Math.abs(angleY)){
            return 270-baseAngle(angleX,angleY);
          }else if(Math.abs(angleX) > Math.abs(angleY)){
            return 180+baseAngle(angleY,angleX);
          }else if(Math.abs(angleX) == Math.abs(angleY)){
            return 225;
          }else return 270;
        }else if(angleX > 0 && angleY < 0){
          if(angleX < Math.abs(angleY)){
            return 270+baseAngle(angleX,angleY);
          }else if(angleX > Math.abs(angleY)){
            return 360-baseAngle(angleY,angleX);
          }else
            return 315;
        }
        return 0;
      }
    private static final int baseAngle(int x,int y){
        int temp = (Math.abs(x) << 10) / Math.abs(y);
        for (int i = 0; i < TAN.length; i++) {
          if (temp <= TAN[i])
            return i;
        }
        return 0;
      }
	
	
	
  private final static int[] sqrtTab = {0, 16, 22, 27, 32, 35, 39, 42, 45,
                                     48, 50, 53, 55, 57, 59, 61, 64, 65, 67, 69,
                                     71, 73, 75, 76, 78, 80,
                                     81, 83, 84, 86, 87, 89, 90, 91, 93, 94, 96,
                                     97, 98, 99, 101, 102,
                                     103, 104, 106, 107, 108, 109, 110, 112,
                                     113, 114, 115, 116, 117,
                                     118, 119, 120, 121, 122, 123, 124, 125,
                                     126, 128, 128, 129, 130,
                                     131, 132, 133, 134, 135, 136, 137, 138,
                                     139, 140, 141, 142, 143,
                                     144, 144, 145, 146, 147, 148, 149, 150,
                                     150, 151, 152, 153, 154,
                                     155, 155, 156, 157, 158, 159, 160, 160,
                                     161, 162, 163, 163, 164,
                                     165, 166, 167, 167, 168, 169, 170, 170,
                                     171, 172, 173, 173, 174,
                                     175, 176, 176, 177, 178, 178, 179, 180,
                                     181, 181, 182, 183, 183,
                                     184, 185, 185, 186, 187, 187, 188, 189,
                                     189, 190, 191, 192, 192,
                                     193, 193, 194, 195, 195, 196, 197, 197,
                                     198, 199, 199, 200, 201,
                                     201, 202, 203, 203, 204, 204, 205, 206,
                                     206, 207, 208, 208, 209,
                                     209, 210, 211, 211, 212, 212, 213, 214,
                                     214, 215, 215, 216, 217,
                                     217, 218, 218, 219, 219, 220, 221, 221,
                                     222, 222, 223, 224, 224,
                                     225, 225, 226, 226, 227, 227, 228, 229,
                                     229, 230, 230, 231, 231,
                                     232, 232, 233, 234, 234, 235, 235, 236,
                                     236, 237, 237, 238, 238,
                                     239, 240, 240, 241, 241, 242, 242, 243,
                                     243, 244, 244, 245, 245,
                                     246, 246, 247, 247, 248, 248, 249, 249,
                                     250, 250, 251, 251, 252,
                                     252, 253, 253, 254, 254, 255};

private static long adjustment(long x, long xn) {
    long xn2 = xn * xn;
    
    long comparitor0 = xn2 - x;
    if (comparitor0 < 0) {
        comparitor0 = -comparitor0;
    }

    long twice_xn = xn << 1;

    long comparitor1 = x - xn2 + twice_xn - 1;
    if (comparitor1 < 0) {
        comparitor1 = -comparitor1;
    }

    long comparitor2 = xn2 + twice_xn + 1 - x;

    if (comparitor0 > comparitor1) {
        return (comparitor1 > comparitor2) ? ++xn : --xn;
    }

    return (comparitor0 > comparitor2) ? ++xn : xn;
}

public static int sqrtValue(int x1,int y1,int x2,int y2){//任意2点间的距离
	
	return sqrt( (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
}
public static int sqrt(long x) {
    long xn;

    if (x >= 0x10000) {
        if (x >= 0x1000000) {
            if (x >= 0x10000000) {
                if (x >= 0x40000000) {
                    xn = sqrtTab[(int) (x >> 24)] << 8;
                } else {
                    xn = sqrtTab[(int) (x >> 22)] << 7;
                }
            } else {
                if (x >= 0x4000000) {
                    xn = sqrtTab[(int) (x >> 20)] << 6;
                } else {
                    xn = sqrtTab[(int) (x >> 18)] << 5;
                }
            }

            xn = (xn + 1 + (x / xn)) >> 1;
            xn = (xn + 1 + (x / xn)) >> 1;

            return (int)adjustment(x, xn);
        } else {
            if (x >= 0x100000) {
                if (x >= 0x400000) {
                    xn = (long) sqrtTab[(int) (x >> 16)] << 4;
                } else {
                    xn = (long) sqrtTab[(int) (x >> 14)] << 3;
                }
            } else {
                if (x >= 0x40000) {
                    xn = (long) sqrtTab[(int) (x >> 12)] << 2;
                } else {
                    xn = (long) sqrtTab[(int) (x >> 10)] << 1;
                }
            }

            xn = (xn + 1 + (x / xn)) >> 1;

            return (int)adjustment(x, xn);
        }
    } else {
        if (x >= 0x100) {
            if (x >= 0x1000) {
                if (x >= 0x4000) {
                    xn = sqrtTab[(int) (x >> 8)] + 1;
                } else {
                    xn = (sqrtTab[(int) (x >> 6)] >> 1) + 1;
                }
            } else {
                if (x >= 0x400) {
                    xn = (sqrtTab[(int) (x >> 4)] >> 2) + 1;
                } else {
                    xn = (sqrtTab[(int) (x >> 2)] >> 3) + 1;
                }
            }

            return (int)adjustment(x, xn);
        } else {
            if (x >= 0) {
                return (int)adjustment(x, sqrtTab[(int) x] >> 4);
            }
        }
    }

    return -1;
}

public static int getPercent(int num, int per,int numlimit) {//求百分比
	
	if(per == 0||numlimit == 0){
		return 0;
	}

	if(num *per/numlimit > per){
		return per;
	}
	return num *per/numlimit;
	
}


}

